Linking Yitzhaki's and Dagum's Gini decompositions
نویسندگان
چکیده
منابع مشابه
Gini, Deprivation and Complaints
Recent insights from the philosopher Larry Temkin have suggested a new basis for the measurement of income inequality, founded on the notion of individual complaints. about income distribution. Under certain specifications of the relationship between complaints and personal incomes it can be shown that a concept similar to the concept of deprivation then emerges. In turn deprivation is related ...
متن کاملMultidimensional Generalized Gini Indices
The axioms used to characterize the generalized Gini social evaluation orderings for one-dimensional distributions are extended to the multidimensional attributes case. A social evaluation ordering is shown to have a two-stage aggregation representation if these axioms and a separability assumption are satisfied. In the first stage, the distributions of each attribute are aggregated using gener...
متن کاملLinking Perceived Employee Voice and Creativity
Researchers are of the belief that employee voice has favorable effects for both the employee and the organization. However, the effect of employee voice on creativity, and the process through which it influences creativity, has hitherto received little attention. This study aimed at investigating the relationship between perceived employee voice and creativity. Employees of three premier dairy...
متن کاملInfinite-dimensional versions of the primary, cyclic and Jordan decompositions
The famous primary and cyclic decomposition theorems along with the tightly related rational and Jordan canonical forms are extended to linear spaces of infinite dimensions with counterexamples showing the scope of extensions.
متن کاملFinding Branch-Decompositions and Rank-Decompositions
We present a new algorithm that can output the rank-decomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most k if such exists. This algorithm works also for partitioned matroids. Both these algorithms are fixed-parameter tractable, that is, they run...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Economics
سال: 2011
ISSN: 0003-6846,1466-4283
DOI: 10.1080/00036846.2011.568410